Improving the feasibility pump
نویسندگان
چکیده
منابع مشابه
Improving the feasibility pump
The Feasibility Pump of Fischetti, Glover, Lodi, and Bertacco [8, 7] has proved to be a very successful heuristic for finding feasible solutions of mixed integer programs. The quality of the solutions in terms of the objective value, however, tends to be poor. This paper proposes a slight modification of the algorithm in order to find better solutions. Extensive computational results show the s...
متن کاملImproving the Randomization Step in Feasibility Pump
Feasibility pump (FP) is a successful primal heuristic for mixed-integer linear programs (MILP). The algorithm consists of three main components: rounding fractional solution to a mixed-integer one, projection of infeasible solutions to the LP relaxation, and a randomization step used when the algorithm stalls. While many generalizations and improvements to the original Feasibility Pump have be...
متن کاملNew concave penalty functions for improving the Feasibility Pump
Abstract Mixed-Integer optimization represents a powerful tool for modeling many optimization problems arising from real-world applications. The Feasibility pump is a heuristic for finding feasible solutions to mixed integer linear problems. In this work, we propose a new feasibility pump approach using concave nondifferentiable penalty functions for measuring solution integrality. We present c...
متن کاملThe feasibility pump
In this paper we consider the NP-hard problem of finding a feasible solution (if any exists) for a generic MIP problem of the form min{cT x : Ax ≥ b, xj integer ∀j ∈ I}. Trivially, a feasible solution can be defined as a point x∗ ∈ P := {x : Ax ≥ b} that is equal to its rounding x̃, where the rounded point x̃ is defined by x̃j := [xj ] if j ∈ I and x̃j := xj otherwise, and [·] represents scalar rou...
متن کاملBoosting the feasibility pump
The Feasibility Pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP relaxation feasible but fractional solutions, and integer but LP relaxation infeasible solutions. The process attempts to minimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.10.004